Перевод: с английского на все языки

со всех языков на английский

terminal graph

Страницы

См. также в других словарях:

  • Terminal restriction fragment length polymorphism — (TRFLP or sometimes T RFLP) is a molecular biology technique for profiling of microbial communities based on the position of a restriction site closest to a labeled end of an amplified gene. The method is based on digesting a mixture of PCR… …   Wikipedia

  • graph plotter — braižytuvas statusas T sritis automatika atitikmenys: angl. date plotter; drafter; graph plotter; graphic plotter; graphic terminal; plotter; plotting device; plotting unit vok. Kurvenschreiber, m; Plotter, m; Zeichengerät, n; Zeichenmaschine, f; …   Automatikos terminų žodynas

  • Series-parallel graph — In graph theory, series parallel graphs are graphs with two distinguished vertices called terminals , formed recursively by two simple composition operations. They can be used to model series and parallel electric circuits.Definition and… …   Wikipedia

  • Initial and terminal objects — Terminal element redirects here. For the project management concept, see work breakdown structure. In category theory, an abstract branch of mathematics, an initial object of a category C is an object I in C such that for every object X in C,… …   Wikipedia

  • Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

  • Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number …   Wikipedia

  • Signal-flow graph — A signal flow graph (SFG) is a special type of block diagram[1] and directed graph consisting of nodes and branches. Its nodes are the variables of a set of linear algebraic relations. An SFG can only represent multiplications and additions.… …   Wikipedia

  • Circle graph — For the chart, see Pie chart. A circle with five chords and the corresponding circle graph. In graph theory, a circle graph is the intersection graph of a set of chords of a circle. That is, it is an undirected graph whose vertices can be… …   Wikipedia

  • Quasi-bipartite graph — In the mathematical field of graph theory, an instance of the Steiner tree problem (consisting of an undirected graph G and a set R of terminal vertices that must be connected to each other) is said to be quasi bipartite if the non terminal… …   Wikipedia

  • Path (graph theory) — In graph theory, a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence. The first vertex is called the start vertex and the last vertex is called the end vertex . Both… …   Wikipedia

  • Michigan Terminal System — (MTS) The MTS welcome screen as seen through a 3270 terminal emulator. Company / developer University of Michigan and 7 other universities in the US, Canada, and the UK …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
… Нажмите правой клавишей мыши и выберите «Копировать ссылку»